Rate-Compatible Puncturing of Low-Density Parity-Check Codes

Low Density Parity Check Codes

Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...

Low-density parity-check codes

A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...

The Design of Rate-Compatible Structured Low-Density Parity-Check Codes

Robust Image Transmission with Rate- Compatible Low-Density Parity-Check codes over Noisy Channels

Rate-Compatible Low-Density Parity-Check (RC-LDPC) codes are proposed to provide unequal error protection (UEP) for robust and efficient transmission of progressively compressed images over noisy channels. The total bit budget is partitioned between the source and channel coding, and the optimal rates are assigned to source encoded packets with a trellis-based rate-allocation algorithm using a ...

Rate-compatible Low Density Parity Check Codes for Capacity-approaching ARQ Schemes in Packet Data Communications

Strong rate-compatible codes is important to achieve high throughput in hybrid automatic repeat request with forward error correction (ARQ/FEC) systems in packet data transmission. This paper focuses on the construction of efficient rate-compatible low density parity check (RC-LDPC) codes over a wide rate range. The conventional approach of puncturing is first studied. Analysis on the code ense...